The chromatic index of cyclic Steiner 2-designs
نویسندگان
چکیده
منابع مشابه
A Few More Cyclic Steiner 2-Designs
In this paper, we prove the existence of a cyclic (v, 4, 1)-BIBD for v = 12t + 4, 3 ≤ t ≤ 50 using computer programs, which are useful in recursive constructions for cyclic designs. Applications of these designs to optical orthogonal codes are also mentioned.
متن کاملProduct constructions for cyclic block designs II. Steiner 2-designs
In [4] we introduced a product construction for cyclic Steiner quadruple systems. The purpose of this paper is to modify the construction so that it is applicable to cyclic Steiner 2-designs. A cyclic Steiner 2-design is a Steiner system s(t, k, u), 2 d t < k < u, in which t = 2 and which has an automorphism of order u. We denote such a system by CS(2, k, u). Under suitable conditions we show h...
متن کاملOn the 2-parallel chromatic index of Steiner triple systems
The 2-parallel chromatic index X" (8) is the minimum number of colours required to colour the blocks of a Steiner triple system 8 so that any two parallel blocks receive different colours. The value of X" (v) = min {X" (8) : 8 is an 8TS(v)} is determined for all admissible v.-It is further shown how the 2-parallel chromatic index is related to the independence number and a complete analysis for...
متن کاملThe chromatic index of block intersection graphs of Kirkman triple systems and cyclic Steiner triple systems
The block intersection graph of a combinatorial design with block set B is the graph with B as its vertex set such that two vertices are adjacent if and only if their associated blocks are not disjoint. The chromatic index of a graph G is the least number of colours that enable each edge of G to be assigned a single colour such that adjacent edges never have the same colour. A graph G for which...
متن کاملHalving Steiner 2-designs
A Steiner 2-design S(2,k,v) is said to be halvable if the block set can be partitioned into two isomorphic sets. This is equivalent to an edge-disjoint decomposition of a self-complementary graph G on v vertices into Kks. The obvious necessary condition of those orders v for which there exists a halvable S(2,k,v) is that v admits the existence of an S(2,k,v) with an even number of blocks. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 1982
ISSN: 0161-1712,1687-0425
DOI: 10.1155/s0161171282000775